Optimal Raw Material Inventory Analysis Using Markov Decision Process with Policy Iteration Method

نویسندگان

چکیده

Inventory of raw materials is a big deal in every production process, both company and home business production. In order to meet consumer demand, must be able determine the amount inventory that should provided. The purpose this research choose an alternative selection ordering produce maximum with minimum costs. material referred study pandan leaves used make mats. Analysis was Markov decision process policy iteration method by considering discount factor. From analysis conducted, it obtained policies taken producers results can consideration for actors location deciding optimal obtain operational cost.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Online Markov decision processes with policy iteration

The online Markov decision process (MDP) is a generalization of the classical Markov decision process that incorporates changing reward functions. In this paper, we propose practical online MDP algorithms with policy iteration and theoretically establish a sublinear regret bound. A notable advantage of the proposed algorithm is that it can be easily combined with function approximation, and thu...

متن کامل

The Policy Iteration Method for the Optimal Stopping of a Markov Chain with an Application

• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...

متن کامل

Policy Iteration for Decentralized Control of Markov Decision Processes

Coordination of distributed agents is required for problems arising in many areas, including multi-robot systems, networking and e-commerce. As a formal framework for such problems, we use the decentralized partially observable Markov decision process (DECPOMDP). Though much work has been done on optimal dynamic programming algorithms for the single-agent version of the problem, optimal algorit...

متن کامل

Simplified policy iteration for skip-free Markov decision processes

We describe and analyse a new simplified policy iteration type algorithm for finite average cost Markov decision processes that are skip-free in the negative direction. We show that the algorithm is guaranteed to converge after a finite number of iterations, but the computational effort required for each iteration step is comparable with that for value iteration. We show that the analysis can b...

متن کامل

Optimal Threshold Probability and Policy Iteration in Semi-markov Decision Processes

We consider undiscounted semi-Markov decision process with a target set and our main concern is a problem minimizing threshold probability. We formulate the problem as an infinite horizon case with a recurrent class. We show that an optimal value function is a unique solution to an optimality equation and there exists a stationary optimal policy. Also several value iteration methods and a polic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: JTAM (Jurnal Teori dan Aplikasi Matematika)

سال: 2022

ISSN: ['2597-7512', '2614-1175']

DOI: https://doi.org/10.31764/jtam.v6i3.8563